Repeated compositions of Möbius transformations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On iterates of Möbius transformations on fields

Let p be a quadratic polynomial over a splitting field K, and S be the set of zeros of p. We define an associative and commutative binary relation on G ≡ K∪{∞}−S so that every Möbius transformation with fixed point set S is of the form x “plus” c for some c. This permits an easy proof of Aitken acceleration as well as generalizations of known results concerning Newton’s method, the secant metho...

متن کامل

Compositions of tree series transformations

Tree series transformations computed by bottom-up and top-down tree series transducers are called bottomup and top-down tree series transformations, respectively. (Functional) compositions of such transformations are investigated. It turns out that the class of bottom-up tree series transformations over a commutative and complete semiring is closed under left-composition with linear bottom-up t...

متن کامل

Robust ILC design using Möbius transformations

Abstract: In this paper a general ILC algorithm is examined and it is found that the filters involved can be selected to satisfy frequency-wise uncertainty limits on the plant model. The probability of the plant model being at a given point in the uncertainty space is specified, and the filters are then chosen to maximise the convergence rate that can be expected in practice. The magnitude of t...

متن کامل

Möbius Transformations For Global Intrinsic Symmetry Analysis

The goal of our work is to develop an algorithm for automatic and robust detection of global intrinsic symmetries in 3D surface meshes. Our approach is based on two core observations. First, symmetry invariant point sets can be detected robustly using critical points of the Average Geodesic Distance (AGD) function. Second, intrinsic symmetries are self-isometries of surfaces and as such are con...

متن کامل

Compositions of Bottom-Up Tree Series Transformations

Tree series transformations computed by bottom-up tree series transducers are called bottom-up tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottom-up tree series transformations over commutative and א0-complete semirings are closed under left-composition with linear bottom-up tree series transformations and right-composition ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ergodic Theory and Dynamical Systems

سال: 2018

ISSN: 0143-3857,1469-4417

DOI: 10.1017/etds.2018.43